The Number of Maximal Independent Sets in the Hamming Cube
نویسندگان
چکیده
Let Qn be the n-dimensional Hamming cube and N = 2n. We prove that number of maximal independent sets in is asymptotically $$2n{2^{N/4}},$$ as was conjectured by Ilinca first author connection with a question Duffus, Frankl Rödl. The value natural lower bound derived from between induced matchings. proof it also an upper draws on various tools, among them “stability” results for set counts old new isoperimetric behavior Qn.
منابع مشابه
Maximal independent sets in the covering graph of the cube
Several familiar problems in extremal set theory can be cast as questions about the maximum possible size of an independent set defined on a suitable graph, about the total number of independent sets in such graphs, or about enumeration of the maximal independent sets. Here we find bounds on the number of maximal independent sets in the covering graph of a hypercube. © 2010 Elsevier B.V. All ri...
متن کاملdetermination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولThe Maximum Number of Maximal Independent Sets in Forests
Let G be a simple and undirected graph. By mi(G) we denote the number of maximal independent sets in G. In this note, we determine the maximum number of maximal independent sets among the set of a type of forests. Mathematics Subject Classification: 05C05; 05C50; 05C69
متن کاملIntegers for the Number of Maximal Independent Sets in Graphs
Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, maximum) independent sets in G. In this paper we determine the third and fouth largest value of mi(G) among all graphs of order n. Moreover, the extremal graphs achieving these values are also determined. Mathematics Subject Classification: 05C35, 05C69, 68R10
متن کاملOn the number of maximal independent sets in a graph
Let G be a (simple, undirected, finite) graph. A set S ⊆ V (G) is independent if no edge of G has both its endpoints in S. An independent set S is maximal if no independent set of G properly contains S. Let MIS(G) be the set of all maximal independent sets in G. Miller and Muller (1960) and Moon and Moser (1965) independently proved that the maximum, taken over all n-vertex graphs G, of |MIS(G)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2022
ISSN: ['0209-9683', '1439-6912']
DOI: https://doi.org/10.1007/s00493-021-4729-9